Solving polynomial systems via homotopy continuation and monodromy
نویسندگان
چکیده
We develop an algorithm to find all solutions of a generic system in a family of polynomial systems with parametric coefficients using numerical homotopy continuation and the action of the monodromy group. We argue that the expected number of homotopy paths that this algorithm needs to follow is roughly linear in the number of solutions. We demonstrate that our software implementation is competitive with the existing state-of-theart methods implemented in other software packages.
منابع مشابه
Using Monodromy to Avoid High Precision
When solving polynomial systems with homotopy continuation, the fundamental numerical linear algebra computations become inaccurate when two paths are in close proximity. The current best defense against this ill-conditioning is the use of adaptive precision. While sufficiently high precision indeed overcomes any such loss of accuracy, high precision can be very expensive. In this article, we d...
متن کاملSolving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud. Via the graph isomorphism problem we organize...
متن کاملUsing Monodromy to Decompose Solution Sets of Polynomial Systems into Irreducible Components
To decompose solution sets of polynomial systems into irreducible components, homotopy continuation methods generate the action of a natural monodromy group which partially classi es generic points onto their respective irreducible components. As illustrated by the performance on several test examples, this new method achieves a great increase in speed and accuracy, as well as improved numerica...
متن کاملNumerical Stablity of Path Tracing in Polyhedral Homotopy Continuation Methods
The reliability of polyhedral homotopy continuation methods for solving a polynomial system becomes increasingly important as the dimension of the polynomial system increases. High powers of the homotopy continuation parameter t and ill-conditioned Jacobian matrices encountered in tracing of homotopy paths affect the numerical stability. We present modified homotopy functions with a new homotop...
متن کاملCmpsc : a Continuation Method for Polynomial Systems (c++ Version)
CMPSc is a C++ program for homotopy continuation methods to find all isolated solutions of a system of polynomial equations. The numerical methods for solving polynomial systems employed in CMPSc are equivalent to the ones used in a matlab program CMPSm. The focus of CMPSc is on implementation of the cheater’s homotopy. The software CMPSc, this manual and some numerical examples are available a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1609.08722 شماره
صفحات -
تاریخ انتشار 2016